46 research outputs found
Lipschitz functions on classical spaces
AbstractWe show that, for everyÉ > 0 and every Lipschitz functionf from the unit sphere of the Banach spacec0 to â, there is an infinite-dimensional subspace ofc0, on the unit sphere of whichf varies by at most É. This result is closely related to a theorem of Hindman, and a well known open problem in Banach space theory
Quasirandom permutations are characterized by 4-point densities
For permutations Ï and Ï of lengths |Ï|â€|Ï| , let t(Ï,Ï) be the probability that the restriction of Ï to a random |Ï| -point set is (order) isomorphic to Ï . We show that every sequence {Ïj} of permutations such that |Ïj|ââ and t(Ï,Ïj)â1/4! for every 4-point permutation Ï is quasirandom (that is, t(Ï,Ïj)â1/|Ï|! for every Ï ). This answers a question posed by Graham
Testing Linear-Invariant Non-Linear Properties
We consider the task of testing properties of Boolean functions that are
invariant under linear transformations of the Boolean cube. Previous work in
property testing, including the linearity test and the test for Reed-Muller
codes, has mostly focused on such tasks for linear properties. The one
exception is a test due to Green for "triangle freeness": a function
f:\cube^{n}\to\cube satisfies this property if do not all
equal 1, for any pair x,y\in\cube^{n}.
Here we extend this test to a more systematic study of testing for
linear-invariant non-linear properties. We consider properties that are
described by a single forbidden pattern (and its linear transformations), i.e.,
a property is given by points v_{1},...,v_{k}\in\cube^{k} and
f:\cube^{n}\to\cube satisfies the property that if for all linear maps
L:\cube^{k}\to\cube^{n} it is the case that do
not all equal 1. We show that this property is testable if the underlying
matroid specified by is a graphic matroid. This extends
Green's result to an infinite class of new properties.
Our techniques extend those of Green and in particular we establish a link
between the notion of "1-complexity linear systems" of Green and Tao, and
graphic matroids, to derive the results.Comment: This is the full version; conference version appeared in the
proceedings of STACS 200
Expansion in SL_d(Z/qZ), q arbitrary
Let S be a fixed finite symmetric subset of SL_d(Z), and assume that it
generates a Zariski-dense subgroup G. We show that the Cayley graphs of pi_q(G)
with respect to the generating set pi_q(S) form a family of expanders, where
pi_q is the projection map Z->Z/qZ
Bounds for graph regularity and removal lemmas
We show, for any positive integer k, that there exists a graph in which any
equitable partition of its vertices into k parts has at least ck^2/\log^* k
pairs of parts which are not \epsilon-regular, where c,\epsilon>0 are absolute
constants. This bound is tight up to the constant c and addresses a question of
Gowers on the number of irregular pairs in Szemer\'edi's regularity lemma.
In order to gain some control over irregular pairs, another regularity lemma,
known as the strong regularity lemma, was developed by Alon, Fischer,
Krivelevich, and Szegedy. For this lemma, we prove a lower bound of
wowzer-type, which is one level higher in the Ackermann hierarchy than the
tower function, on the number of parts in the strong regularity lemma,
essentially matching the upper bound. On the other hand, for the induced graph
removal lemma, the standard application of the strong regularity lemma, we find
a different proof which yields a tower-type bound.
We also discuss bounds on several related regularity lemmas, including the
weak regularity lemma of Frieze and Kannan and the recently established regular
approximation theorem. In particular, we show that a weak partition with
approximation parameter \epsilon may require as many as
2^{\Omega(\epsilon^{-2})} parts. This is tight up to the implied constant and
solves a problem studied by Lov\'asz and Szegedy.Comment: 62 page
A quantitative version of the non-abelian idempotent theorem
Suppose that G is a finite group and A is a subset of G such that 1_A has
algebra norm at most M. Then 1_A is a plus/minus sum of at most L cosets of
subgroups of G, and L can be taken to be triply tower in O(M). This is a
quantitative version of the non-abelian idempotent theorem.Comment: 82 pp. Changed the title from `Indicator functions in the
Fourier-Eymard algebra'. Corrected the proof of Lemma 19.1. Expanded the
introduction. Corrected typo
Expansion in perfect groups
Let Ga be a subgroup of GL_d(Q) generated by a finite symmetric set S. For an
integer q, denote by Ga_q the subgroup of Ga consisting of the elements that
project to the unit element mod q. We prove that the Cayley graphs of Ga/Ga_q
with respect to the generating set S form a family of expanders when q ranges
over square-free integers with large prime divisors if and only if the
connected component of the Zariski-closure of Ga is perfect.Comment: 62 pages, no figures, revision based on referee's comments: new ideas
are explained in more details in the introduction, typos corrected, results
and proofs unchange
How to think about informal proofs
This document is the Accepted Manuscript version of the following article: Brendan Larvor, âHow to think about informal proofsâ, Synthese, Vol. 187(2): 715-730, first published online 9 September 2011. The final publication is available at Springer via doi:10.1007/s11229-011-0007-5It is argued in this study that (i) progress in the philosophy of mathematical practice requires a general positive account of informal proof; (ii) the best candidate is to think of informal proofs as arguments that depend on their matter as well as their logical form; (iii) articulating the dependency of informal inferences on their content requires a redefinition of logic as the general study of inferential actions; (iv) it is a decisive advantage of this conception of logic that it accommodates the many mathematical proofs that include actions on objects other than propositions; (v) this conception of logic permits the articulation of project-sized tasks for the philosophy of mathematical practice, thereby supplying a partial characterisation of normal research in the fieldPeer reviewedFinal Accepted Versio